Conditions for extended operator precedence parsing
نویسندگان
چکیده
منابع مشابه
Parallel parsing of operator precedence grammars
Operator precedence grammars, introduced by Floyd several decades ago, enjoy properties that make them very attractive to face problems and to exploit technologies highly relevant in these days. In this paper we focus on their local parsability property, i.e, the fact that any substring s of a longer one x.s.y can be parsed independently of its context without the risk of invalidating the parti...
متن کاملValidity Test for Floyd's Operator-Precedence Parsing Algorithms
A polynomial time algorithm is developed to decide the equivalence of an operator-precedence grammar with the underlying Floyd's operator-precedence parsing algorithm, a result of possible practical significance. As a consequence the necessary and sufficient condition for an operatorprecedence grammar to be the valid grammatical characterization of the underlying Floyd's operator-precedence par...
متن کاملOperator Precedence ω-Languages
Recent literature extended the analysis of ω-languages from the regular ones to various classes of languages with “visible syntax structure”, such as visibly pushdown languages (VPLs). Operator precedence languages (OPLs), instead, were originally defined to support deterministic parsing and exhibit interesting relations with these classes of languages: OPLs strictly include VPLs, enjoy all rel...
متن کاملOperator Precedence \omega-languages
ω-languages are becoming more and more relevant nowadays when most applications are “ever-running”. Recent literature, mainly under the motivation of widening the application of model checking techniques, extended the analysis of these languages from the simple regular ones to various classes of languages with “visible syntax structure”, such as visibly pushdown languages (VPLs). Operator prece...
متن کاملWeighted Operator Precedence Languages
In the last years renewed investigation of operator precedence languages (OPL) led to discover important properties thereof: OPL are closed with respect to all major operations, are characterized, besides the original grammar family, in terms of an automata family and an MSO logic; furthermore they significantly generalize the well-known visibly pushdown languages (VPL). In another area of rese...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1979
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/22.2.164